Step of Proof: pair_eta_rw
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
pair
eta
rw
:
A
:Type,
B
:(
A
Type),
p
:(
a
:
A
B
(
a
)). <
p
.1,
p
.2> =
p
latex
by ((UnivCD)
CollapseTHENA ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
1.
A
: Type
C1:
2.
B
:
A
Type
C1:
3.
p
:
a
:
A
B
(
a
)
C1:
<
p
.1,
p
.2> =
p
C
.
Definitions
t
T
,
x
(
s
)
,
x
:
A
.
B
(
x
)
origin